A Method for Hiding Secret Messages using Minimum-Redundancy Codes

This paper demonstrates an effective lossless data hiding scheme using min imum Redundancy codes. The binary secret message is concurrently embedded and encoded with a cover medium such as a video file, an audio file, or even a text file. The proposed scheme not only provides good data hiding capacity and data recovery capability, but also being efficient in space saving. Each symbol in a cover medium can carry one secret bit, and the cover medium can be reversed. And the experimental results show that the redundancy code can saves up to 38% of space compared with the cover medium. In this paper, the symbol or sequence of symbols associated with a given message will be called the "message code." The entire number of messages which might be transmitted will be called the "message ensemble." The mutual agreement between the transmitter and the receiver about the meaning of the code for each message of the ensemble will be called the "ensemble code."